Smart - grid Electricity Allocation via Strip Packing with Slicing ∗ ( Extended Abstract )

One advantage of smart grids is that they can reduce the peak load by distributing electricity-demands over multiple short intervals. Finding a schedule that minimizes the peak load corresponds to a variant of a strip packing problem. Normally, for strip packing problems, a given set of axis-aligned rectangles must be packed into a fixed-width strip, and the goal is to minimize the height of the strip. The electricityallocation application can be modelled as strip packing with slicing: each rectangle may be cut vertically into multiple slices and the slices may be packed into the strip as individual pieces. The stacking constraint forbids solutions in which a vertical line intersects two slices of the same rectangle. We give a fully polynomial time approximation scheme for this problem, as well as a practical polynomial algorithm that slices each rectangle at most once and yields a solution of height at most 5/3 times the optimal height.